String Rewriting and Metabolism: a Logical Perspective

Universit a Di Pisa from String Rewriting to Logical Metabolic Systems from String Rewriting to Logical Metabolic Systems

Termination of Cycle Rewriting by Transformation and Matrix Interpretation

We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them that ...

Parsing and Generation as Datalog Queries

We show that the problems of parsing and surface realization for grammar formalisms with “context-free” derivations, coupled with Montague semantics (under a certain restriction) can be reduced in a uniform way to Datalog query evaluation. As well as giving a polynomialtime algorithm for computing all derivation trees (in the form of a shared forest) from an input string or input logical form, ...

Toward the Concurrent Implementation ofComputational

This paper places concurrent rewriting in the perspective of supporting the development and use of computational systems. We brieey recall the usefulness of computational systems (i.e. a rewriting theory with strategies) as a logical framework. We then show that the right implementation model for concurrent rewriting allows us to give a meaning to the concurrent rewrite of overlapping redexes. ...

Learning from a Substructural Perspective

In this paper we study learning from a logical perspective. We show that there is a strong relationship between a learning strategy, its formal learning framework and its logical represen-tational theory. This relationship enables one to translate learnability results from one theory to another. Moreover if we go from a classical logic theory to a substructural logic theory, we can transform le...